H-Mine: Fast and space-preserving frequent pattern mining in large databases

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

H-Mine: Fast and space-preserving frequent pattern mining in large databases

JIAN PEI1,∗, JIAWEI HAN2, HONGJUN LU3,†, SHOJIRO NISHIO4, SHIWEI TANG5 and DONGQING YANG5 1School of Computing Science, Simon Fraser University, Burnaby, BC, Canada V5A 1S6 E-mail: [email protected] 2University of Illinois Urbana, IL 61801, USA E-mail: [email protected] 3Hong Kong University of Science and Technology, Hong Kong 4Osaka University, Osaka, Japan E-mail: [email protected] 5P...

متن کامل

H-Mine: Hyper-Structure Mining of Frequent Patterns in Large Databases

Methods for efficient mining of frequent patterns have been studied extensively by many researchers. However, the previously proposed methods still encounter some performance bottlenecks when mining databases with different data characteristics, such as dense vs. sparse, long vs. short patterns, memory-based vs. disk-based, etc. In this study, we propose a simple and novel hyperlinked data stru...

متن کامل

Parallel Regular-Frequent Pattern Mining in Large Databases

Mining interesting patterns in various domains is an important area in data mining and knowledge discovery process. A number of parallel and distributed frequent pattern mining algorithms have been proposed so far for the large and/or distributed databases. Occurrence frequency is not the only criteria to mine the patterns but also occurrence behavior (regularity) of a pattern may also be inclu...

متن کامل

The Fuzzy Frequent Pattern Tree for Mining Large Databases

A significant data mining issue is the effective discovery of association rules. The extraction of association rules faces the problem of the combinatorial explosion of the search space, and the loss of information by the discretizat ion of values. The first problem is confronted effectively by the Frequent Pattern Tree approach of [10 ]. This approach avoids the candidate generation phase of A...

متن کامل

Temporal Databases and Frequent Pattern Mining Techniques

Data mining is the process of exploring and analyzing data from different perspective, using automatic or semiautomatic techniques to extract knowledge or useful information and discover correlations or meaningful patterns and rules from large databases. One of the most vital characteristic missed by the traditional data mining systems is their capability to record and process time-varying aspe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IIE Transactions

سال: 2007

ISSN: 0740-817X,1545-8830

DOI: 10.1080/07408170600897460